Edge Kempe equivalence of regular graph covers
نویسندگان
چکیده
منابع مشابه
Kempe Equivalence of Colorings
Several basic theorems about the chromatic number of graphs can be extended to results in which, in addition to the existence of a kcoloring, it is also shown that all k-colorings of the graph in question are Kempe equivalent. Here, it is also proved that for a planar graph with chromatic number less than k, all k-colorings are Kempe equivalent.
متن کاملAlgorithmic Aspects of Regular Graph Covers
A graph G covers a graph H if there exists a locally bijective homomorphism from G to H. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of Aut(G). We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for given graphs G and H whether G regularly covers H. When |H| = ...
متن کاملDistance regular covers of the complete graph
Distance regular graphs fall into three families: primitive, antipodal, and bipar-tite. Each antipodal distance regular graph is a covering graph of a smaller (usually primitive) distance regular graph; the antipodal distance graphs of diameter three are covers of the complete graph, and are the first non-trivial case. Many of the known examples are connected with geometric objects, such as pro...
متن کاملSampling Edge Covers in 3-Regular Graphs
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidly for graphs with degrees at most three. Glauber dynamics have been studied extensively in the statistical physics community, with special emphasis on lattice graphs. Our results apply, for example, to the hexagonal l...
متن کاملEdge Regular Graph Products
A regular nonempty graph Γ is called edge regular, whenever there exists a nonegative integer λΓ, such that any two adjacent vertices of Γ have precisely λΓ common neighbours. An edge regular graph Γ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer μΓ, such that any two vertices at distance 2 have precisely μΓ common neighbours...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2019
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22500